Blockwise Solid Burst Error Correcting Codes

Codes Correcting Repeated Burst Errors Blockwise

This paper obtains bounds for linear codes which are capable to correct the errors blockwise which occur during the process of transmission. The kind of errors considered are known as repeated burst errors of length b(fixed), introduced by Dass and Garg (2009). An illustration for such kind of codes has also been provided. Mathematics Subject Classification: 94B20, 94B25, 94B65

Blockwise Repeated Low - Density Burst Error Correcting Linear Codes

The paper presents necessary and sufficient condition on the number of parity-check digits required for the existence of a linear code capable of correcting errors in the form of 2-repeated low-density bursts occurring within a sub-block. An illustration of a code of length 24 correcting all 2-repeated low-density bursts of length 3 or less with weight 2 or less occurring within a sub-block of ...

Error Locating Codes by Using Blockwise-tensor Product of Blockwise Detecting/correcting Codes

In this paper, we obtain lower and upper bounds on the number of parity check digits of a linear code that corrects e or less errors within a subblock. An example of such a code is provided. We introduce blockwise-tensor product of matrices and using this, we propose classes of error locating codes (or EL-codes) that can detect e or less errors within a sub-block and locate several such corrupt...

On 2-repeated Solid Burst Errors

There are several kinds of errors for which error detecting and error correcting codes have been constructed. Solid burst errors are common in many communications. In general communication due to the long messages, the strings of solid bursts of small length may repeat in a vector itself. The concept of repeated bursts is introduced by Beraradi, Dass and Verma[3] which has opened a new area of ...

Burst Error Correcting Codes and Lattice Paths